Representing Protein Sequence with Low Number of Dimensions
نویسندگان
چکیده
منابع مشابه
Combining Three Scoring Algorithms for Representing Protein Sequence
Effective representation of the protein sequence is a key issue in detecting remote protein homology. Recent work using string kernels for protein data has achieved state-of-the-art performance for protein classification. However, such representations are suffering from high dimensionality problem. In this work, we introduce a simple method based on representing the protein sequence by fix dime...
متن کاملRepresenting the Dimensions of an Ecological Niche
Niche theory has driven a century of ecological investigations and has been the starting point for the few studies in existence of ecological ontology. This study investigates how scientists conceptualize niche theory, and uses that information to develop a high level ontological framework. That framework includes process, theory, entities, experiments, space, and time. These components are lin...
متن کاملOn Numerical Investigation of Semi-empirical Relations Representing Local Nusselt Number at Lower Nozzle-target Spacing’s
Examining the cooling rate using impingement of air jet finds a wide application in electronic packaging and micro-scale fluid heat interaction systems, While the prediction of Nusselt profile at low nozzle-target spacing is a big issue. The plot of area average Nusselt number magnitude against the nozzle-target spacing (Z/d) shows a gradual decrement in the profile upto Z/d = 1 and beyond that...
متن کاملRepresenting Changes in XML Documents using Dimensions
In this paper we present a method for representing the his tory of XML documents using Multidimensional XML MXML We demonstrate how a set of basic change operations on XML documents can be represented in MXML and show that temporal XML snapshots can be obtained from MXML representations of XML histories We also argue that our model is capable to represent changes not only in an XML document but...
متن کاملOn the Representing Number of Intersecting Families
1. Introduction. One of the best-known results in extremal set theory is the Theorem of Erdös-Ko-Rado [3] : Suppose n > 2 k, and let 9i be a family of k-subsets of an n-set M such that any two members of M intersect non-trivially, then I J1I < (k-1). Furthermore, the bound can be attained, and the extremal families are precisely the families SJ7ta = {X D a : a E M{ for k > 3. Many proofs of thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Biological Sciences
سال: 2005
ISSN: 1727-3048
DOI: 10.3923/jbs.2005.795.800